A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs

نویسنده

  • Linh Anh Nguyen
چکیده

We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLD-resolution calculus for MProlog in all of the basic serial modal logics KD , T , KDB , B , KD4, S4, KD5, KD45, and S5. For an MProlog program P and for L being one of the mentioned logics, we define an operator TL,P , which has the least fixpoint IL,P . This fixpoint is a set of formulae, which may contain labeled forms of the modal operator 3, and is called the least L-model generator of P . The standard model of IL,P is shown to be a least L-model of P . The SLD-resolution calculus for MProlog is designed with a similar style as for classical logic programming. It is sound and complete. We also extend the calculus for MProlog in the almost serial modal logics KB , K5, K45, and KB5.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An SLD-Resolution Calculus for Basic Serial Multimodal Logics

We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T , B, 4, 5 (in the form, e.g., 4 : iφ → j kφ) and I : iφ → jφ. We do not assume any special restriction for the form of programs and goals. Our fixpoint semantics and SLD-resolution calculus are defined using the direct approach ...

متن کامل

Reasoning About Epistemic States of Agents by Modal Logic Programming

Modal logic programming is one of appropriate approaches to deal with reasoning about epistemic states of agents. We specify here the least model semantics, the fixpoint semantics, and an SLD-resolution calculus for modal logic programs in the multimodal logic KD4Ig5a, which is intended for reasoning about belief and common belief of agents. We prove that the presented SLD-resolution calculus i...

متن کامل

The Modal Logic Programming System MProlog: Theory, Design, and Implementation

We present a general framework for developing fixpoint semantics, the least model semantics, and SLD-resolution calculi for logic programs in normal multimodal logics whose frame restrictions consist of the conditions of seriality (i.e. ∀x ∃y Ri(x, y)) and some classical firstorder Horn formulas. Our approach is direct and no special restriction on occurrences of 2i and 3i is assumed. We prove ...

متن کامل

A Fixpoint Semantics for Disjunctive Logic Programs

D We present a fixpoint semantics for disjunctive logic programs. We extend the concept of the Herbrand base of a logic program to consist of all positive clauses that may be formed using the atoms in the Herbrand base. A monotonic closure operator is defined, operating on the lattice formed by the power set of the extended Herbrand base. The closure operator is shown to achieve a least fixpoin...

متن کامل

On Greatest Fixpoint Semantics of Logic Programming

The study of fixpoints has long been at the heart of logic programming. However, whereas least fixpoint semantics works well for SLD-refutations (i.e. is sound and complete), there is no satisfactory (i.e. complete) fixpoint semantics for infinite derivations. In this paper, we focus on this problem. Standard approaches in this area consist in concentrating on infinite derivations that can be s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2003